Integer points enumerator of hypergraphic polytopes
نویسندگان
چکیده
For a hypergraphic polytope there is weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines f-polynomial. This invariant of hypergraphs extends the Stanley chromatic symmetric simple graphs. We consider certain combinatorial Hopf algebra show that universal morphism to functions coincides with this enumerator function. calculate f-polynomial uniform polytopes.
منابع مشابه
Integer Points in Knapsack Polytopes and s-Covering Radius
Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, we consider for a positive integer s the set Fs(A) ⊂ Zm of all vectors b ∈ Zm such that the associated knapsack polytope P (A, b) = {x ∈ R>0 : Ax = b} contains at least s integer points. We present lower and upper bounds on the so called diagonal s-Frobenius number associated to the set Fs(A). In the case m = 1 we prove an optim...
متن کاملInteger Feasibility of Random Polytopes
We study integer programming instances over polytopes P (A, b) = {x : Ax ≤ b} where the constraint matrix A is random, i.e., its entries are i.i.d. Gaussian or, more generally, its rows are i.i.d. from a spherically symmetric distribution. The radius of the largest inscribed ball is closely related to the existence of integer points in the polytope. We show that for m = 2 √ , there exist consta...
متن کاملMaximum Entropy Gaussian Approximations for the Number of Integer Points and Volumes of Polytopes
We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X ⊂ Rn in a polyhedron P ⊂ Rn, by solving a certain entropy maximization problem, we construct a probability distribution on the set X such that a) the probability mass function is constant on the set P ∩X and b) the expectation of the dis...
متن کاملMaximum Entropy Gaussian Approximation for the Number of Integer Points and Volumes of Polytopes
We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X ⊂ Rn in a polyhedron P ⊂ Rn we construct a probability distribution on the set X by solving a certain entropy maximization problem such that a) the probability mass function is constant on the set P ∩X and b) the expectation of the distr...
متن کاملPoints in Two Polytopes
We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding t.he minimum-norm point in a polytope.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications De L'institut Mathematique
سال: 2021
ISSN: ['0350-1302', '1820-7405']
DOI: https://doi.org/10.2298/pim200205001p